The maximum diameter of total domination edge-critical graphs
نویسندگان
چکیده
منابع مشابه
Total Domination Edge Critical Graphs with Maximum Diameter
Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination edge critical, or simply γtcritical, if γt(G + e) < γt(G) for each edge e ∈ E(G). For 3t-critical graphs G, that is, γt-critical graphs with γt(G) = 3, the diameter of G is either 2 or 3. We characterise the 3t-critical graphs G with diam G = 3.
متن کاملDiameter of paired domination edge-critical graphs
A paired dominating set of a graph G without isolated vertices is a dominating set of G whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality amongst all paired dominating sets of G. The graph G is paired domination edge-critical (γprEC) if for every e ∈ E(G), γpr(G+ e) < γpr(G). We investigate the diameter of γprEC graphs. To this ef...
متن کاملOn the diameter of total domination vertex critical graphs
In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs and independent domination vertex critical graphs and connected domination vertex critical graphs. We provide upper bounds on the diameter of them, two of which are sharp. MSC (2010): 05C12, 05C69
متن کاملThe diameter of total domination vertex critical graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. These graphs we call γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We characterize the connected graphs with minimum degree one t...
متن کاملOn the total restrained domination edge critical graphs
Let G = (V, E) be a graph. A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V −D has a neighbor in V −D. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number of G. In this paper, we define the concept of total restrained domination edge critical graphs, find a lower bound for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.09.032